salesman problem造句

• Crossover tabu search for traveling salesman problem
  一种求解旅行商问题的交叉禁忌搜索
• Directed black and white traveling salesman problem
  有向黑白旅行商问题
• An algorithms with taboo search in traveling salesman problem
  一种求解旅行商问题的禁忌搜索算法
• A new hybrid genetic algorithm for traveling salesman problem
  一种新的求解旅行商问题的混合遗传算法
• Fractals combined with case-base for traveling salesman problems
  分形法与范例库推理相结合进化求解旅行商问题
• Traveling salesman problem
  旅行商问题
• Traveling salesman problem
  旅行商问题
• Traveling salesman problem
  旅行商问题
• The most common example is the notorious " traveling salesman problem, " which, at first sight, appears almost innocuous
  最常见的例子是著名的“旅行商问题”，这个问题乍一看几乎是平淡乏味的：
• The paper discusses the operational characteristics of warehouse and gives a common order picking optimal algorithm for travel salesman problem
  摘要分析了自动化仓库堆垛机拣选作业的运行特点，给出了堆垛机拣选作业旅行商数学模型的常用优化算法。
• How to improve smt produce efficiency and how to optimize smt system ? the travelling salesman problem ( tsp ) base on smt optimization is provided
  如何提高smt系统的生产效率，如何更好地优化smt系统，基于smt系统优化的旅行商问题(tsp)就提出来了。
• The solving tsp ( traveling salesman problem ) examples as benchmark shows that this platform can increase the branch and bound algorithm's efficiency and get the optimal solution sooner
  计算表明，在保证求得最优解的前提下，该平台能很好地提高分支定界算法的效率。
• By use of the properties of ergodicity, randomicity, and regularity of chaos, a chaos ant colony optimization ( caco ) algorithm is proposed to solve traveling salesman problem
  摘要利用混沌运动的遍历性、随机性和规律性等特点，提出了一种求解旅行商问题的混沌蚁群(caco)算法。
• The traveling salesman problem ( tsp ) is a typical optimization problem, which belongs to a large family of problems classified as np-complete . it has the important project background
  旅行商问题(tsp)是一个有着重要工程背景、在图论中的典型组合优化问题，已被证实是一个np完全问题。
• The conception and method of online scheduling in parcel post automated warehouse are put forward, that is dynamic scheduling problem, which is equal to solve online traveling salesman problem
  提出了邮包自动化仓库在线调度的概念和方法，即动态调度问题，实际上等同于解决在线旅行商问题。
• This paper develops an ant colony optimization approach to the orienteering problem, a general version of the well-known traveling salesman problem with many relevant applications in industry
  摘要本研究发展一蚁群最佳化演算法求解越野赛跑问题，此问题可被视为一广义之??推销员问题，其应用?围极为广泛。
• The travelling salesman problem is always one of the most interesting and the hardest topic in combinatorial majorization . there is currently a lot of ongoing activity in the scientific community to research tsp
  旅行商问题就是一类有代表性的已被证明具有npc计算复杂性的组合优化难题，是目前国内外研究的热点和前沿问题。
• This paper mainly focuses on the air sequencing problem in terminal area . by means of the single-machine scheduling method, the practical problem is reformulated into the cumulative traveling salesman problem with ready times ( ctsr-rt )
  本文主要针对终端区空中交通流量管理中的飞机排序问题，运用单机排序方法，将其转化为一带准备时间的累积旅行商问题(ctsp?rt)。
• Ga has been successfully used in a lot of fields such as the travelling salesman problem, scheduling, function optimization, machine learning etc . at the same time dsp also has been successfully used in many fields because of its flexibility, programmable
  同时数字信号处理器所具有的系统构成灵活、可编程、适用面广的特点，使其在众多领域成为不可或缺的数字处理的计算引擎。
• As one of the latter algorithms, ant colony algorithm has been used to many fields, such as : traveling salesman problem, quadratic assignment problem, network routing and load-balancing problem, vlsi design, etc
  摘要蚁群算法作为一种较新的进化类方法，目前已经在若干领域取得了成功的应用，诸如：旅行商问题、二次分配问题、通讯网络中的路由问题以及负载平衡问题、大规模集成电路设计等。